from collections import deque
# 地图和方向定义
mp = [[0]*51 for _ in range(31)]
k = ['D', 'L', 'R', 'U']
dir = [(1,0), (0,-1), (0,1), (-1,0)]
vis = [[0]*50 for _ in range(30)]

def bfs(x, y, path):
    q = deque()
    q.append((x, y, path))
    while q:
        now = q.popleft()
        x, y, path = now
        if x == 29 and y == 49:
            print(path)
            return

        for i in range(4):
            next_x = x + dir[i][0]
            next_y = y + dir[i][1]

            if next_x < 0 or next_x >= 30 or next_y < 0 or next_y >= 50:
                continue

            if vis[next_x][next_y] == 1 or mp[next_x][next_y] == '1':
                continue

            vis[next_x][next_y] = 1
            next_node = (next_x, next_y, path + k[i])
            q.append(next_node)


for i in range(30):
    mp[i] = list(input().strip())
vis[0][0] = 1
bfs(0, 0, '')
